Kinetic Medians and kd-Trees
نویسندگان
چکیده
We propose algorithms for maintaining two variants of kd-trees of a set of moving points in the plane. A pseudo kd-tree allows the number of points stored in the two children to differ. An overlapping kd-tree allows the bounding boxes of two children to overlap. We show that both of them support range search operations in O(n) time, where 2 only depends on the approximation precision. When the points move, we use event-based kinetic data structures to update the tree when necessary. Both trees undergo only a quadratic number of events, which is optimal, and the update cost for each event is only polylogarithmic. To maintain the pseudo kd-tree, we make use of algorithms for computing an approximate median level of a line arrangement, which itself is of great interest. We show that the computation of the approximate median level of a set of lines or line segments, can be done in an online fashion smoothly, i.e., there are no expensive updates for any events. For practical consideration, we study the case when there are speed limit restrictions or smooth trajectory requirements. The maintenance of the pseudo kd-tree, as a consequence of the approximate median algorithm, can also adapt to those restrictions.
منابع مشابه
Kinetic kd-Trees
We propose a simple variant of kd-trees, called rankbased kd-trees, for sets of points in R. We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search queries in O(n1−1/d + k) time, where k is the output size. The main advantage of rank-based kd-trees is that they can be efficiently kinetized: the KDS processes O(n) events in the worst case, assuming that the points fol...
متن کاملUsing median sets for inferring phylogenetic trees
MOTIVATION Algorithms for phylogenetic tree reconstruction based on gene order data typically repeatedly solve instances of the reversal median problem (RMP) which is to find for three given gene orders a fourth gene order (called median) with a minimal sum of reversal distances. All existing algorithms of this type consider only one median for each RMP instance even when a large number of medi...
متن کاملBiodiversity on Broadway - Enigmatic Diversity of the Societies of Ants (Formicidae) on the Streets of New York City
Each year, a larger proportion of the Earth's surface is urbanized, and a larger proportion of the people on Earth lives in those urban areas. The everyday nature, however, that humans encounter in cities remains poorly understood. Here, we consider perhaps the most urban green habitat, street medians. We sampled ants from forty-four medians along three boulevards in New York City and examined ...
متن کاملInversion Medians Outperform Breakpoint Medians in Phylogeny Reconstruction from Gene-Order Data
Phylogeny reconstruction from gene-order data has attracted much attention over the last few years. The two software packages used for that purpose, BPAnalysis and GRAPPA, both use so-called breakpoint medians in their computations. Some of our past results indicate that using inversion scores rather than breakpoint scores in evaluating trees leads to the selection of better trees. On that basi...
متن کاملRandomly Projected KD-Trees with Distance Metric Learning for Image Retrieval
Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree) usually are only efficient for low dimensional data, but often perform no better than a simple exhaustive linear search when the number of dimensions is large enough. Recently, approximate NN search techniques have been propo...
متن کامل